The Co-Evolution of Memetic Algorithms for Protein Structure Prediction
نویسنده
چکیده
This paper describes a co-evolutionary learning-optimisation approach to Protein Structure Prediction which uses a Memetic Algorithm as its underlying search method. Instance-specific knowledge can be learned, stored and applied by the system in the form of a population of rules. These rules determine the neighbourhoods used by the local search process, which is applied to each member of the co-evolving population of candidate solutions. A generic co-evolutionary framework is proposed for this approach, and the implementation of a simple Self-Adaptive instantiation is described. A rule defining the local search’s move operator is encoded as a {condition : action} pair and added to the genotype of each individual. It is demonstrated that the action of mutation and crossover on the patterns encoded in these rules, coupled with the action of selection on the resultant phenotypes is sufficient to permit the discovery and propagation of knowledge about the instance being optimised. The algorithm is benchmarked against a simple Genetic Algorithm, a Memetic Algorithm using a fixed neighbourhood function, and a similar Memetic Algorithm which uses random (rather than evolved) rules and shows significant improvements in terms of the ability to locate optimum configurations using Dill’s HP model. It is shown that this “metalearning” of problem features provides a means of creating highly scalable
منابع مشابه
A Differential Evolution and Spatial Distribution based Local Search for Training Fuzzy Wavelet Neural Network
Abstract Many parameter-tuning algorithms have been proposed for training Fuzzy Wavelet Neural Networks (FWNNs). Absence of appropriate structure, convergence to local optima and low speed in learning algorithms are deficiencies of FWNNs in previous studies. In this paper, a Memetic Algorithm (MA) is introduced to train FWNN for addressing aforementioned learning lacks. Differential Evolution...
متن کاملGenetic and Memetic Algorithms for Sequencing a New JIT Mixed-Model Assembly Line
This paper presents a new mathematical programming model for the bi-criteria mixed-model assembly line balancing problem in a just-in-time (JIT) production system. There is a set of criteria to judge sequences of the product mix in terms of the effective utilization of the system. The primary goal of this model is to minimize the setup cost and the stoppage assembly line cost, simultaneously. B...
متن کاملNovel Memetic Algorithm for Protein Structure Prediction
A novel Memetic Algorithm (MA) is proposed for investigating the complex ab initio protein structure prediction problem. The proposed MA has a new fitness function incorporating domain knowledge in the form of two new measures (H-compliance and P-compliance) to indicate hydrophobic and hydrophilic nature of a residue. It also includes two novel techniques for dynamically preserving best fit sch...
متن کاملMemetic Algorithms for Neural Network Training in Bioinformatics
Bioinformatics is a new, rapidly growing, scientific area that exploits computational techniques to study DNA and protein sequences. A particularly interesting task in this context is to predict the structure of proteins. Artificial Neural Networks can efficiently handle classification and prediction tasks. On the other hand, Memetic Algorithms belong to the class of heuristic methods that have...
متن کامل